Engineering Quantitative Aptitude English Reasoning General Knowledge Coding Others

Quiz: DSP - Discrete Fourier transform

To View Tricks: Login Required

Number of Questions: 26

Question: 1 -

Circular shift of an N point is equivalent to

Options:

  1. Circular shift of its aperiodic extension and its vice versa

  2. Circular shift of its periodic extension and its vice versa

  3. Linear shift of its aperiodic extension and its vice versa

  4. Linear shift of its periodic extension and its vice versa

    5. Answer:

    Linear shift of its periodic extension and its vice versa
    Solution not available.

Question: 2 -

The circular convolution of two sequences in time domain is equivalent  to

Options:

  1. Multiplication of DFTs of two sequences

  2. Difference of DFTs of two sequences

  3. Summation of DFTs of two sequences

  4. Square of multiplication of DFTs of two sequences

    5. Answer:

    Multiplication of DFTs of two sequences
    Solution not available.

Question: 3 -

The basic properties of DFT includes

1) Linearity
2) Periodicity
3) Circular symmetry
4) Summation

Options:

  1. 1, 2 and 4 are correct

  2. 1 and 3 are correct

  3. All the four are correct

  4. 1, 2 and 3 are correct

    5. Answer:

    1, 2 and 3 are correct
    Solution not available.

Question: 4 -

How many complex additions are needed for 16 direct computations in discrete Fourier transform?

Options:

  1. 32

  2. 756

  3. 240

  4. 56

    5. Answer:

    240
    Solution not available.

Question: 5 -

DFT is applied to

Options:

  1. Finite discrete sequences

  2. Continuous finite sequences

  3. Infinite sequences

  4. Continuous infinite signals

    5. Answer:

    Finite discrete sequences
    Solution not available.